Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications
نویسندگان
چکیده
AbstractPseudorandom quantum states (PRS) are efficiently constructible that computationally indistinguishable from being Haar-random, and have recently found cryptographic applications. We explore new definitions, properties applications of pseudorandom states, present the following contributions: 1. New Definitions: study variants function-like state (PRFS) generators, introduced by Ananth, Qian, Yuen (CRYPTO’22), where pseudorandomness property holds even when generator can be queried adaptively or in superposition. show feasibility these assuming existence post-quantum one-way functions. 2. Classical Communication: PRS generators with logarithmic output length imply commitment encryption schemes classical communication. Previous constructions such required 3. Simplified Proof: give a simpler proof Brakerski–Shmueli (TCC’19) result polynomially-many copies uniform superposition random binary phases Haar-random states. 4. Necessity Computational Assumptions: also secure logarithmic, larger, key necessarily requires computational assumptions.
منابع مشابه
State Recovery Attacks on Pseudorandom Generators
State recovery attacks comprise an important class of attacks on pseudorandom generators. In this paper we analyze resistance of pseudorandom generators against these attacks in terms of concrete security. We show that security of the BlumMicali pseudorandom generator against state recovery attacks is tightly related to the security of the corresponding one-way function. C. Wolf, S. Lucks, P.-W...
متن کاملBrains and pseudorandom generators
In a pioneering classic, Warren McCulloch and Walter Pitts proposed a model of the central nervous system; motivated by EEG recordings of normal brain activity, Chvátal and Goldsmith asked whether or not this model can be engineered to provide pseudorandom number generators. We supply evidence suggesting that the answer is negative.
متن کاملRobust Pseudorandom Generators
Let G : {0, 1} → {0, 1} be a pseudorandom generator. We say that a circuit implementation of G is (k, q)-robust if for every set S of at most k wires anywhere in the circuit, there is a set T of at most q|S| outputs, such that conditioned on the values of S and T the remaining outputs are pseudorandom. We initiate the study of robust PRGs, presenting explicit and non-explicit constructions in w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-22318-1_9